Motzkin predecomposable sets

نویسندگان

  • Alfredo N. Iusem
  • Juan Enrique Martínez-Legaz
  • Maxim I. Todorov
چکیده

We introduce and study the family of sets in a finite dimensional Euclidean space which can be written as the Minkowski sum of a compact and convex set and a convex cone (not necessarily closed). We establish several properties of the class of such sets, called Motzkin predecomposable, some of which hold also for the class of Motzkin decomposable sets (i.e., those for which the convex cone in the decomposition is requested to be closed), while others are specific of the new family.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on a Problem of Motzkin Regarding Density of Integral Sets with Missing Differences

For a given set M of positive integers, a problem of Motzkin asks to determine the maximal density μ(M) among sets of nonnegative integers in which no two elements differ by an element of M . The problem is completely settled when |M | ≤ 2, and some partial results are known for several families of M when |M | ≥ 3. In 1985 Rabinowitz & Proulx provided a lower bound for μ({a, b, a+ b}) and conje...

متن کامل

A Quantitative Variant of the Multi-colored Motzkin-Rabin Theorem

We prove a quantitative version of the multi-colored Motzkin-Rabin theorem in the spirit of [BDWY12]: Let V1, . . . , Vn ⊂ R be n disjoint sets of points (of n ‘colors’). Suppose that for every Vi and every point v ∈ Vi there are at least δ|Vi| other points u ∈ Vi so that the line connecting v and u contains a third point of another color. Then the union of the points in all n sets is contained...

متن کامل

Avoiding patterns in irreducible permutations

We explore the classical pattern avoidance question in the case of irreducible permutations, i.e., those in which there is no index i such that σ(i + 1) − σ(i) = 1. The problem is addressed completely in the case of avoiding one or two patterns of length three, and several well known sequences are encountered in the process, such as Catalan, Motzkin, Fibonacci, Tribonacci, Padovan and Binary nu...

متن کامل

Motzkin Paths, Motzkin Polynomials and Recurrence Relations

We consider the Motzkin paths which are simple combinatorial objects appearing in many contexts. They are counted by the Motzkin numbers, related to the well known Catalan numbers. Associated with the Motzkin paths, we introduce the Motzkin polynomial, which is a multi-variable polynomial “counting” all Motzkin paths of a certain type. Motzkin polynomials (also called Jacobi-Rogers polynomials)...

متن کامل

The Efficient Computation of Ownership Sets in HPF

ÐOwnership sets are fundamental to the partitioning of program computations across processors by the owner-computes rule. These sets arise due to the mapping of arrays onto processors. In this paper, we focus on how ownership sets can be efficiently determined in the context of the HPF language and show how the structure of these sets can be symbolically characterized in the presence of arbitra...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Global Optimization

دوره 60  شماره 

صفحات  -

تاریخ انتشار 2014